Deferred, Self-Organizing BSP Trees

Deferred, Self-Organizing BSP Trees

BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures is the choice of cutting planes. Rather than base these choices solely on the properties of the scene, we propose using information about how the tree is used in order to determine its structure. We demonstrate how th...

Self-customized BSP trees for collision detection

The ability to perform eecient collision detection is essential in virtual reality environments and their applications, such as walkthroughs. In this paper we re-explore a classical structure used for collision detection { the binary space partitioning tree. Unlike the common approach, which attributes equal likelihood to each possible query, we assume events that happened in the past are more ...

EÆcient Object BSP Trees

In this paper we investigate Object Oriented Binary Space Partitioning. The Binary Space Partition Tree (BSP-Trees) is a widely used and e ective data structure for solid modeling and hidden surface removal. We present algorithms for eÆciently constructing Object BSP Trees(OBSP) in 2-Dimensions. The term object used arises since the construction of our tree utilizes the property of hierarchical...

The Self-Organizing Map of Attribute Trees

The standard version of the Self-Organzing Map (Kohonen 1990) applies vector data. This paper explains how attribute trees can be used as the learning medium in the Self-Organizing Map. As a data structure, a tree is an optimal presentation of many hierarchical and dynamical objects appearing in natural phenomena and human activities. The proposed approach is based on introducing a distance met...

Extremal Queries using BSP Trees